Labeling sequents; its motivations and applications

نویسنده

  • Patrick Girard
چکیده

Hacking applied a method involving the labeling of sequent members to the problem of giving a Gentzen-style system for S 5, called L5, formulated with strict implication and no special modal operator. The method was generalized to a labeling of hypersequents by G. Mints. In this paper, we show how this generalization eliminates an “anti-symmetry” in Hacking’s system and greatly simplifies L5. We then suggest a semantic interpretation of the labeling of L5 derived objects and indicate a straightforward completeness result through Shvarts’ LK45 system. We finally show how the labeling method can be used to introduce new strong negation operators in logics intermediate between classical and intuitionistic logic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factors Affecting Entrepreneurial Motivation of Agricultural Students at Razi University

The main purpose of this study was to investigate factors affecting entrepreneurial motivations of agricultural students at Razi University. Statistical population of this study consisted of all agricultural undergraduate students (senior) (N=186), that 164 of them were selected as research sample using proportionate stratified sampling method. The main instrument in this study was questionnair...

متن کامل

Fertility Motivations and Its Related Factors in Women of Reproductive Age Attended Health Centers in Sabzevar, Iran

Background & aim: The severe reduced fertility rate and growing increase of older population in Iran have led to economic and social consequences in the country. Therefore, the purpose of this study was to investigate the fertility motivations and some of its related factors in women of reproductive age referring to urban health centers. Methods: This cross-sectional study was performed on 450 ...

متن کامل

The distinguishing chromatic number of bipartite graphs of girth at least six

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

متن کامل

Proof Theory for Indexed Nested Sequents

Fitting’s indexed nested sequents can be used to give deductive systems to modal logics which cannot be captured by pure nested sequents. In this paper we show how the standard cut-elimination procedure for nested sequents can be extended to indexed nested sequents, and we discuss how indexed nested sequents can be used for intuitionistic modal logics.

متن کامل

Nested Sequents for Provability Logic GLP

We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005